/*
void step(int s, int f, int p)
{
  if (s == f)
  {
    cout<< "way"<< endl;
	for (int i=0; i<p; i++)
	{
	  cout<< road[i]<<" ";
	}
  }
  else
  {
    for (int c=0; c<N; c++)
	{
      if ((map[s][c] != 0) && (incl[c] == 0))
	  {
	    road[p] = c;
	    incl[c] = 1;
		step(c, f, p+1);
		incl[c] = 0;
		road[p] = 0;
	  }
	}
  }
}
*/
